This method greatly improves the conventional vector radix 2D Fast Hartley Transform Algorithm. 比普通矢量基二维哈脱莱变换算法运算量进一步减少。
A multi-dimensional vector radix Fast Fourier Transform ( FFT) algorithm with Decimation In Frequency ( DIF) was proposed. 给出了频域抽取(DIF)多维向量基快速傅里叶变换(FFT)算法。
A Zero Factor Prime Radix Fourier Transform ( ZFT) Algorithm and Its Hardware Realization 零因子素数傅里叶变换(ZFT)及其硬件实现
A Digital Circular Convolution Algorithm by Radix 2 Polynomial Transform 基2的多项式变换求循环卷积的算法
When designing the monitoring system, the author carries out simultaneously theoretical analysis and improvement on conventional radix 2 Fast Fourier Transform ( FFT), Split Radix FFT ( SRFFT), our algorithms can save 33% multiplications for DFT approximately as compared to the traditional algorithms. 基于分裂基的SRFFT算法实现离散傅立叶变换,较传统基2FFT算法节省33%的运算量,可提高运算效率。
Integer DCT transform is one of the main renovation for compression efficiency improvement. For the integer DCT radix can't be unique within the same transform principle, finding the radix is another valuable research topic besides integer DCT theory. 整数变换是其提高压缩性能最主要的改进之一,基于同样的整数变换过程的变换基可以不唯一,因此在整数变换的理论确定后,寻找变换基是一个重要的研究内容。
Algorithm for Vector Radix Direct Fast Fourier Transform of Bivariable Function 两维向量基直接FFT算法
Based on the prime radix DFT and number theory, an algorithm using the second order recursive filter and the zero factor prime radix Fourier Transform ( ZFT) is presented. 从素基数DFT出发,应用数论理论讨论了一种应用二阶递归滤波结构的算法及零因子转换算法(ZFT)。
Split Vector Radix 2D Fast Hartley Transform 分离矢量基二维哈脱莱变换算法
Based on the Split radix FFT ( SRFFT) algorithm for one dimensional discrete fourier transform, a fast algorithm for two-dimensional discrete fourier transform is proposed. 在一维离散Fourier变换分裂基算法(SRFFT)的基础上,给出了二维离散Fourier变换的一种快速算法,通过对二维序列的抽取和分解,降低了算法的时间复杂度。
A split radix fast algorithm is presented for shift discrete Fourier transform ( SDFT). 提出了一种计算移位离散傅里叶变换(SDFT)的分裂基快速算法。